flow in network meaning in English
网络流
Examples
- Ford , l . r . , fulkerson d . r . , flows in networks , princeton university press , 1962
田丰、马仲蕃， 《图与网络流理论》 ，科学出版社， 1987 。 - In this paper , we built a network model of the optimal cost flow in network with capacity and fuzzy weight , and give an algorithm for soloving the optimal cost flow according to fuzzy decision
建立赋模糊数为费用权的容量-费用网络中，据模糊决策来求解最佳费用流的网络模型，并给出这一模型的相应算法。 - Abstract : in this paper , we built a network model of the optimal cost flow in network with capacity and fuzzy weight , and give an algorithm for soloving the optimal cost flow according to fuzzy decision
文摘:建立赋模糊数为费用权的容量-费用网络中，据模糊决策来求解最佳费用流的网络模型，并给出这一模型的相应算法。 - Although the congestion control research of host - ends has made great strides , the current queue management mechanism in router is not able to provide end - to - end congestion control mechanism to sustain the above environment , namely , the unfairness of assigned bandwidth or drop - rate for different types of flows and the synchronization of all tcp flows in network . so it is necessary to improve the classical queue management mecnanism such as drop _ tail and red in order to boost the qos ( quality of service ) . this article analyzes the main traits of host - ends congestion control and all kinds of fashionable queue management machanism , which include queue mechanism with absolute priority , weighted fair queue mechanism and class - based queue mechanism
本文分析了主机端的拥塞控制机制和网络中路由器的现有各种队列管理机制：绝对优先级队列机制、加权公平队列( weightedfairqueue ) [ 1 ]机制、基于类的队列( class - basedqueue ) [ 2 ]机制以及red ( randomearlydetection ) [ 3 ]机制的主要特点，并重点针对ietf ( internetengineeringtaskforce )推荐的把red算法与明确的拥塞通告ecn ( explicitcongestionnotification ) [ 4 ]结合的方法进行了分析，发现随着internet流量的日益递增， red机制的依赖平均队列长度来管理拥塞控制的算法并不能有效地阻止包丢失：与drop - tail相比， red确实消除了对阵发流量( tcp )的偏见，但是增加了平滑流量( udp )的丢包概率。